An investigation of due-date assignment rules with constrained tightness
نویسندگان
چکیده
منابع مشابه
Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers...
متن کاملAn Empirical Bayes Approach to Due Date Assignment
We consider a model in which there are m products and for each i=1,...,m, there are ni observations of the service times associated with the th i product. Assuming the service times associated with the th i product follow an exponential distribution with parameter i θ , and i θ 's are independent random variables with a common gamma distribution, with unknown parameters α and β , we provide two...
متن کاملProduct due date assignment for complex assemblies
A method is described to assign product due dates for multistage assemblies with uncertain manufacturing and assembly process times. Earliest start times of operations are specified by a predetermined production plan and processing time distributions for operations are truncated at minimum processing times. The method systematically decomposes the complex product structures of multistage assemb...
متن کاملComparison Analysis of Due Date Assignment Methods Using Scheduling Rules in a Job Shop Production System
This paper presents a simulation and comparison analysis conducted to investigate the due-date assignment methods through various scheduling rules. The due date assignment methods investigated are flow time due date (FTDD) and total work content (TWK) method. Three scheduling rules are integrated in the simulation for scheduling of jobs on machines. The performance of the study is evaluated bas...
متن کاملDue-date assignment and parallel-machine scheduling with deteriorating jobs
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Operations Management
سال: 1981
ISSN: 0272-6963
DOI: 10.1016/0272-6963(81)90014-0